Decision trees with minimum average depth for sorting eight elements
نویسندگان
چکیده
منابع مشابه
Average Depth and Number of Misclassifications for Decision Trees
This paper presents a new tool for the study of relationships between total path length or average depth and number of misclafficiations for decision trees. In addition to algorithm, the paper also presents the results of experiments with datasets from UCI ML Repository [1].
متن کاملBounds on Average Weighted Depth of Decision Trees
Upper and lower bounds on minimal average weighted depth and minimal average depth of decision trees over arbitrary information systems are considered. In proofs methods of test theory and rough set theory are used.
متن کاملLearning Sorting and Decision Trees with POMDPs
pomdps are general models of sequential decisions in which both actions and observations can be probabilistic. Many problems of interest can be formulated as pomdps, yet the use of pomdps has been limited by the lack of eeective algorithms. Recently this has started to change and a number of problems such as robot navigation and planning are beginning to be formulated and solved as pomdps. The ...
متن کاملMinimum Average Delay of Routing Trees
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T . In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree...
متن کاملOn Minimum Average Stretch Spanning Trees in Polygonal 2-Trees
A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the problem of computing a minimum average stretch spanning tree in polygonal 2-trees, a super class of 2-connected outerplanar graphs. For a polygonal 2-tree on n ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.10.030